Combinatorial excess intersection
نویسنده
چکیده
We provide formulas and develop algorithms for computing the excess numbers of an ideal. The solution for monomial ideals is given by the mixed volumes of polytopes. These results enable us to design numerical algebraic geometry homotopies to compute excess numbers of any ideal.
منابع مشابه
Cs 598csc: Combinatorial Optimization
One of several major contributions of Edmonds to combinatorial optimization is algorithms and polyhedral theorems for matroid intersection, and more generally polymatroid intersection. From an optimization point of view, the matroid intersection problem is the following: Let M1 = (S, I1) and M2 = (S, I2) be two matroids on the same ground set S. Then I1 ∩ I2 is the collection of all sets that a...
متن کاملSink Location Service Based on Fano Plane in Wireless Sensor Networks
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...
متن کاملA tracing method for parametric Bezier triangular surface/plane intersection
Surface/plane intersection problem is a special case of surface/surface intersection, and is an active area of research across many disciplines in computer-aided geometric design. This paper presents, in general the setting of derivational continuities, (i.e. C, C, and C), a surface/plane intersection algorithm for parametric Bézier triangular surface over triangular domain. The present algorit...
متن کاملCombinatorial optimization algorithms for intelligent vehicle sequencing problem at an isolated intersection
As the development of telecommunication technology and miniaturization technology, intelligent vehicles equipped with microprocessor devices become more and more popular. This encourages researchers to propose new strategies to efficiently improve the traffic situation, especially at intersections. In this study, we present a novel vehicle sequencing algorithm based on analysis of the informati...
متن کاملMatching, matroids, and extensions
Perhaps the two most fundamental well-solved models in combinatorial optimization are the optimal matching problem and the optimal matroid intersection problem. We review the basic results for both, and describe some more recent advances. Then we discuss extensions of these models, in particular, two recent ones—jump systems and path-matchings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 68 شماره
صفحات -
تاریخ انتشار 2015